TSTP Solution File: NUM706^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM706^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:14:40 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 13 ( 8 unt; 5 typ; 0 def)
% Number of atoms : 8 ( 7 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 16 ( 4 ~; 0 |; 0 &; 12 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 2 ( 0 ^ 2 !; 0 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(func_def_0,type,
nat: $tType ).
thf(func_def_1,type,
x: nat ).
thf(func_def_2,type,
ts: nat > nat > nat ).
thf(func_def_3,type,
n_1: nat ).
thf(f9,plain,
$false,
inference(trivial_inequality_removal,[],[f8]) ).
thf(f8,plain,
x != x,
inference(superposition,[],[f7,f6]) ).
thf(f6,plain,
! [X0: nat] :
( ( ts @ X0 @ n_1 )
= X0 ),
inference(cnf_transformation,[],[f1]) ).
thf(f1,axiom,
! [X0: nat] :
( ( ts @ X0 @ n_1 )
= X0 ),
file('/export/starexec/sandbox2/tmp/tmp.DjlKQrxuwo/Vampire---4.8_11224',satz28a) ).
thf(f7,plain,
( x
!= ( ts @ x @ n_1 ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f5,plain,
( x
!= ( ts @ x @ n_1 ) ),
inference(flattening,[],[f3]) ).
thf(f3,negated_conjecture,
( x
!= ( ts @ x @ n_1 ) ),
inference(negated_conjecture,[],[f2]) ).
thf(f2,conjecture,
( x
= ( ts @ x @ n_1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.DjlKQrxuwo/Vampire---4.8_11224',satz28e) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM706^1 : TPTP v8.1.2. Released v3.7.0.
% 0.03/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 14:56:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.DjlKQrxuwo/Vampire---4.8_11224
% 0.20/0.38 % (11514)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.20/0.38 % (11516)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.20/0.38 % (11513)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.20/0.38 % (11511)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.20/0.38 % (11517)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.20/0.38 % (11512)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.20/0.38 % (11518)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.20/0.38 % (11519)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.20/0.38 % (11514)First to succeed.
% 0.20/0.38 % (11511)Also succeeded, but the first one will report.
% 0.20/0.38 % (11516)Instruction limit reached!
% 0.20/0.38 % (11516)------------------------------
% 0.20/0.38 % (11516)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (11516)Termination reason: Unknown
% 0.20/0.38 % (11516)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (11516)Memory used [KB]: 5500
% 0.20/0.38 % (11516)Time elapsed: 0.004 s
% 0.20/0.38 % (11516)Instructions burned: 2 (million)
% 0.20/0.38 % (11516)------------------------------
% 0.20/0.38 % (11516)------------------------------
% 0.20/0.38 % (11512)Also succeeded, but the first one will report.
% 0.20/0.38 % (11514)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for Vampire---4
% 0.20/0.38 % SZS output start Proof for Vampire---4
% See solution above
% 0.20/0.38 % (11514)------------------------------
% 0.20/0.38 % (11514)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (11514)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (11514)Memory used [KB]: 5500
% 0.20/0.38 % (11514)Time elapsed: 0.003 s
% 0.20/0.38 % (11514)Instructions burned: 1 (million)
% 0.20/0.38 % (11514)------------------------------
% 0.20/0.38 % (11514)------------------------------
% 0.20/0.38 % (11508)Success in time 0.005 s
% 0.20/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------